Computation Over Gaussian Networks With Orthogonal Components

Function computation of arbitrarily correlated discrete sources over Gaussian networks with orthogonal components is studied. Two classes of functions are considered: the arithmetic sum function and the type function. The arithmetic sum function in this paper is defined as a set of multiple weighted arithmetic sums, which includes averaging of the sources and estimating each of the sources as special cases. The type or frequency histogram function counts the number of occurrences of each argument, which yields many important statistics such as mean, variance, maximum, minimum, median, and so on. The proposed computation coding first abstracts Gaussian networks into the corresponding modulo sum multiple-access channels via nested lattice codes and linear network coding and then computes the desired function by using linear Slepian-Wolf source coding. For orthogonal Gaussian networks (with no broadcast and multiple-access components), the computation capacity is characterized for a class of networks. For Gaussian networks with multiple-access components (but no broadcast), an approximate computation capacity is characterized for a class of networks.Comment: 30 pages, 12 figures, submitted to IEEE Transactions on Information Theor

Heartthrob in Cyberspace - The Characteristics of the Popular Online Daters

Online dating websites are currently popular application for Internet users to make new friends and find their partners. An interesting observation is that some people are more popular than others in online dating websites. The current study focus on the personal profile characteristics which make one a popular dater. By two field surveys, this study discusses the relationship between online daters\u27 personal profiles and their popularity

Using Header Session Messages to Filter-out Junk E-mails

Due to the popularity of Internet, e-mail use is the major activity when surfing Internet. However, in recent years, spam has become a major problem that is bothering the use of the e-mail. Many anti-spam filtering techniques have been implemented so far, such as RIPPER rule learning algorithm, Naïve Bayesian classifier, Support Vector Machine, Centroid Based, Decision trees or Memory-base filter. Most existed anti-spamming techniques filter junk emails out according to e-mail subjects and body messages. Nevertheless, subjects and e-mail contents are not the only cues for spamming judgment. In this paper, we present a new idea of filtering junk e-mail by utilizing the header session messages. In message head session, besides sender\u27s mail address, receiver\u27s mail address and time etc, users are not interested in other information. This paper conducted two content analyses. The first content analysis adopted 10,024 Junk e-mails collected by Spam Archive (http://spamarchive.org) in a two-months period. The second content analysis adopted 3,482 emails contributed by three volunteers for a one week period. According to content analysis results, this result shows that at most 92.5% of junk e-mails would be filtered out using message-ID, mail user agent, sender and receiver addresses in the header session as cues. In addition, the idea this study proposed may induce zero over block errors rate. This characteristic of zero over block errors rate is an important advantage for the antispamming approach this study proposed. This proposed idea of using header session messages to filter-out junk e-mails may coexist with other anti-spamming approaches. Therefore, no conflict would be found between the proposed idea and existing anti-spamming approaches

Visualization of metabolic interaction networks in microbial communities using VisANT 5.0

The complexity of metabolic networks in microbial communities poses an unresolved visualization and interpretation challenge. We address this challenge in the newly expanded version of a software tool for the analysis of biological networks, VisANT 5.0. We focus in particular on facilitating the visual exploration of metabolic interaction between microbes in a community, e.g. as predicted by COMETS (Computation of Microbial Ecosystems in Time and Space), a dynamic stoichiometric modeling framework. Using VisANT's unique metagraph implementation, we show how one can use VisANT 5.0 to explore different time-dependent ecosystem-level metabolic networks. In particular, we analyze the metabolic interaction network between two bacteria previously shown to display an obligate cross-feeding interdependency. In addition, we illustrate how a putative minimal gut microbiome community could be represented in our framework, making it possible to highlight interactions across multiple coexisting species. We envisage that the "symbiotic layout" of VisANT can be employed as a general tool for the analysis of metabolism in complex microbial communities as well as heterogeneous human tissues.This work was supported by the National Institutes of Health, R01GM103502-05 to CD, ZH and DS. Partial support was also provided by grants from the Office of Science (BER), U.S. Department of Energy (DE-SC0004962), the Joslin Diabetes Center (Pilot & Feasibility grant P30 DK036836), the Army Research Office under MURI award W911NF-12-1-0390, National Institutes of Health (1RC2GM092602-01, R01GM089978 and 5R01DE024468), NSF (1457695), and Defense Advanced Research Projects Agency Biological Technologies Office (BTO), Program: Biological Robustness In Complex Settings (BRICS), Purchase Request No. HR0011515303, Program Code: TRS-0 Issued by DARPA/CMO under Contract No. HR0011-15-C-0091. Funding for open access charge: National Institutes of Health. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. (R01GM103502-05 - National Institutes of Health; 1RC2GM092602-01 - National Institutes of Health; R01GM089978 - National Institutes of Health; 5R01DE024468 - National Institutes of Health; DE-SC0004962 - Office of Science (BER), U.S. Department of Energy; P30 DK036836 - Joslin Diabetes Center; W911NF-12-1-0390 - Army Research Office under MURI; 1457695 - NSF; HR0011515303 - Defense Advanced Research Projects Agency Biological Technologies Office (BTO), Program: Biological Robustness In Complex Settings (BRICS); HR0011-15-C-0091 - DARPA/CMO; National Institutes of Health)Published versio

Function Computation over Networks:Efficient Information Processing for Cache and Sensor Applications

This thesis looks at efficient information processing for two network applications: content delivery with caching and collecting summary statistics in wireless sensor networks. Both applications are studied under the same paradigm: function computation over networks, where distributed source nodes cooperatively communicate some functions of individual observations to one or multiple destinations. One approach that always works is to convey all observations and then let the destinations compute the desired functions by themselves. However, if the available communication resources are limited, then revealing less unwanted information becomes critical. Centered on this goal, this thesis develops new coding schemes using information-theoretic tools. The first part of this thesis focuses on content delivery with caching. Caching is a technique that facilitates reallocation of communication resources in order to avoid network congestion during peak-traffic times. An information-theoretic model, termed sequential coding for computing, is proposed to analyze the potential gains offered by the caching technique. For the single-user case, the proposed framework succeeds in verifying the optimality of some simple caching strategies and in providing guidance towards optimal caching strategies. For the two-user case, five representative subproblems are considered, which draw connections with classic source coding problems including the Gray-Wyner system, successive refinement, and the Kaspi/Heegard-Berger problem. Afterwards, the problem of distributed computing with successive refinement is considered. It is shown that if full data recovery is required in the second stage of successive refinement, then any information acquired in the first stage will be useful later in the second stage. The second part of this thesis looks at the collection of summary statistics in wireless sensor networks. Summary statistics include arithmetic mean, median, standard deviation, etc, and they belong to the class of symmetric functions. This thesis develops arithmetic computation coding in order to efficiently perform in-network computation for weighted arithmetic sums and symmetric functions. The developed arithmetic computation coding increases the achievable computation rate from $\Theta((\log L)/L)$ to $\Theta(1/\log L)$, where $L$ is the number of sensors. Finally, this thesis demonstrates that interaction among sensors is beneficial for computation of type-threshold functions, e.g., the maximum and the indicator function, and that a non-vanishing computation rate is achievable